منابع مشابه
Refining an Approximate Inverse
Direct methods have made remarkable progress in the computational efficiency of factorization algorithms during the last three decades. The advances in graph theoretic algorithms have not received enough attention from the iterative methods community. For example, we demonstrate how symbolic factorization algorithms from direct methods can accelerate the computation of a factored approximate in...
متن کاملToward an Effective Sparse Approximate Inverse Preconditioner
Sparse approximate inverse preconditioners have attracted much attention recently, because of their potential usefulness in a parallel environment. In this paper, we explore several performance issues related to effective sparse approximate inverse preconditioners (SAIPs) for the matrices derived from PDEs. Our refinements can significantly improve the quality of existing SAIPs and/or reduce th...
متن کاملMultiresolution Approximate Inverse Preconditioners
We introduce a new preconditioner for elliptic PDE’s on unstructured meshes. Using a wavelet-inspired basis we compress the inverse of the matrix, allowing an effective sparse approximate inverse by solving the sparsity vs. accuracy conflict. The key issue in this compression is to use second-generation wavelets which can be adapted to the unstructured mesh, the true boundary conditions, and ev...
متن کاملParallel Approximate Inverse Preconditioners
There has been much excitement recently over the use of approximate inverses for parallel preconditioning. The preconditioning operation is simply a matrix-vector product, and in the most popular formulations, the construction of the approximate inverse seems embarassingly parallel. However, diiculties arise in practical parallel implementations. This paper will survey approximate inverse preco...
متن کاملApproximate MaxEnt Inverse Optimal Control
Maximum entropy inverse optimal control (MaxEnt IOC) is an effective means of discovering the underlying cost function of demonstrated agent’s activity. To enable inference in large state spaces, we introduce an approximate MaxEnt IOC procedure to address the fundamental computational bottleneck stemming from calculating the partition function via dynamic programming. Approximate MaxEnt IOC is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2000
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(00)00399-x